Simultaneous Linear Recurrence Relations with Variable Coefficients
نویسندگان
چکیده
منابع مشابه
Linear Recurrence Relations for Binomial Coefficients modulo a Prime
We investigate when the sequence of binomial coefficients ( k i ) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2h ≤ k < p − h. This hypothesis can be weakened to 2h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relatio...
متن کاملLinear fractional differential equations with variable coefficients
This work is devoted to the study of solutions around an α-singular point x0 ∈ [a, b] for linear fractional differential equations of the form [Lnα(y)](x) = g(x, α), where [Lnα(y)](x) = y(nα)(x)+ n−1 ∑ k=0 ak(x)y (kα)(x) with α ∈ (0, 1]. Here n ∈ N , the real functions g(x) and ak(x) (k = 0, 1, . . . , n−1) are defined on the interval [a, b], and y(nα)(x) represents sequential fractional deriva...
متن کاملThe Automatic Solution of Recurrence Relations I. Linear Recurrences of Finite Order with Constant Coefficients
We describe algorithmic techniques for the efficient solution of awide class of linear recurrences of finite order with constant coefficients.We give an outline of the underlying theory both from an abstract anda more concrete point of view, in an attempt to convey the generalprinciples as clearly as possible yet providing a well marked path forthe implementation. In par...
متن کاملHyers-ulam Stability of the Linear Recurrence with Constant Coefficients
Problem 1.1. Given a metric group (G,·,d), a positive number ε, and a mapping f : G→ G which satisfies the inequality d( f (xy), f (x) f (y)) ≤ ε for all x, y ∈ G, do there exist an automorphism a of G and a constant δ depending only on G such that d(a(x), f (x)) ≤ δ for all x ∈G? If the answer to this question is affirmative, we say that the equation a(xy) = a(x)a(y) is stable. A first answer ...
متن کاملLinear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1958
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500014097